#pragma once
namespace ljp
{
	template<class K, class Hash = HashFunc<K>>
	class unordered_set
	{
		struct unordered_setKeyOfT
		{
			const K& operator()(const K& key)
			{
				return	key;
			}
		};
	public:
		typedef typename hash_bucket::HashTable<K, const K, unordered_setKeyOfT, Hash>::iterator iterator;
		typedef typename hash_bucket::HashTable<K, const K, unordered_setKeyOfT, Hash>::const_iterator const_iterator;

		iterator begin()
		{
			return _ht.begin();
		}
		iterator end()
		{
			return _ht.end();
		}

		const_iterator begin()const
		{
			return _ht.begin();
		}
		const_iterator end()const
		{
			return _ht.end();
		}

		pair<iterator, bool> insert(const K& key)
		{
			return _ht.Insert(key);
		}
		iterator find(const K& key)
		{
			return _ht.Find(key);
		}
		bool erase(const K& key)
		{
			return _ht.Erase(key);
		}
	private:
		hash_bucket::HashTable<K, const K, unordered_setKeyOfT, Hash> _ht;

	};

	void test_unordered_set()
	{
		unordered_set<int> s;
		s.insert(31);
		s.insert(11);
		s.insert(5);
		s.insert(15);
		s.insert(25);

		unordered_set<int>::iterator it = s.begin();
		while (it != s.end())
		{
			//*it = 1;
			cout << *it << " ";
			++it;
		}
		cout << endl;

		for (auto e : s)
		{
			cout << e << " ";
		}
		cout << endl;
	}
}